Efficient Searchable Symmetric Encryption Supporting Dynamic Multikeyword Ranked Search
نویسندگان
چکیده
منابع مشابه
Forward-Private Dynamic Searchable Symmetric Encryption with Efficient Search
Dynamic Searchable Symmetric Encryption (DSSE) allows to delegate keyword search and le update over an encrypted database via encrypted indexes, and therefore provides opportunities to mitigate the data privacy and utilization dilemma in cloud storage platforms. Despite its merits, recent works have shown that e cient DSSE schemes are vulnerable to statistical attacks due to the lack of forward...
متن کاملAdaptively Secure Computationally Efficient Searchable Symmetric Encryption
Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little information as possible to the server. In the symmetric searchable encryption domain, the storage and the retrieval are performed by the same client. Most conventional searchable encryption schemes suffer from two dis...
متن کاملStorage Efficient Substring Searchable Symmetric Encryption
We address the problem of substring searchable encryption. A single user produces a big stream of data and later on wants to learn the positions in the string that some patterns occur. Although current techniques exploit auxiliary data structures to achieve efficient substring search on the server side, the cost at the user side may be prohibitive. We revisit the work of substring searchable en...
متن کاملParallel and Dynamic Searchable Symmetric Encryption
Searchable symmetric encryption (SSE) enables a client to outsource a collection of encrypted documents in the cloud and retain the ability to perform keyword searches without revealing information about the contents of the documents and queries. Although efficient SSE constructions are known, previous solutions are highly sequential. This is mainly due to the fact that, currently, the only met...
متن کاملGarbled Searchable Symmetric Encryption
In a searchable symmetric encryption (SSE) scheme, a client can keyword search over symmetrically-encrypted files which he stored on the server (ideally without leaking any information to the server). In this paper, we show the first multiple keyword search SSE scheme such that even the search formula f (AND, OR and so on) is kept secret. Our scheme is based on an extended garbled circuit satis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Security and Communication Networks
سال: 2020
ISSN: 1939-0114,1939-0122
DOI: 10.1155/2020/7298518